A survey on discriminatory processor sharing

Pricing for Heterogeneous Services at a Discriminatory Processor Sharing Queue

On the equivalence between multiclass PS-type scheduling policies

Consider a single server queue serving a multiclass population. Some popular scheduling policies for such a system (and of interest in this paper) are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). The aim of this paper is to show a certain equivalence between these scheduling policies...

Population effects in multiclass processor sharing queues

Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian or the discriminatory processor sharing discipline. In this paper, we con...

Comparison of the Discriminatory Processor Sharing Policies

Discriminatory Processor Sharing (DPS) policy introduced by Kleinrock [5] is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the jobs priority is controlled by a vector of weights. Verifying the vector of weights, it is possible to control the service rates of the jobs and optimize system characteristics....

Sojourn Times in Non-Homogeneous QBD Processes with Processor Sharing

We study sojourn times of customers in a processor sharing model with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace-Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is given to t...